package dp.dajiajieshe;
//198. 打家劫舍
public class Num198_rob {
    public int rob(int[] nums) {
        if (nums.length == 1)return nums[0];//特殊条件
        int []dp  =new int[nums.length];
        dp[0] = nums[0];
        dp[1] = Math.max(nums[0] , nums[1]);
        for (int i = 2; i < nums.length; i++) {
            dp[i] = Math.max(dp[i - 1] , dp[i - 2] + nums[i]);
        }
        return dp[nums.length - 1];

    }
}
